Segment Reporting

Counting and Reporting Red/Blue Segment Intersections

We simplify the red/blue segment intersection algorithm of Chazelle et al: Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O(n log n) time using O(n) space or report them in additional time proportional to their number. Our algorithm uses a plane sweep to presort the segments; then it operates on a list of slabs that eeciently stores a single level ...

Reporting Bichromatic Segment Intersections from Point Sets

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red and blue, we present an O(n) time and space algorithm for solving the problem of reporting the set of segments of each color intersected by segments of the other color. We al...

A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections

We present a new simple algorithm for computing all intersections between two collections of disjoint line segments. The algorithm runs in O(n log n + k) time and O(n) space, where n and k are the number of segments and intersections respectively. We also show that the algorithm can be extended to handle single-valued curve segments with the same time and space bound.

Standards for Reporting Qualitative Research

سخن سردبیر Editorial مجله دانشگاه علوم پزشکی رفسنجان دوره هجدهم، آذر 1398، 860-859       استاندارد‌هایی برای گزارش پژوهش‌‌های کیفی Standards for Reporting Qualitative Research     محسن رضائیان[1]   M. Rezaeian   تاکنون در مجله علمی دانشگاه، مقالات گوناگونی در خصوص استاندارد‌های تدوین شده برای گزارش شفاف پژوهش‌های کمّی و از جمله کارآزمایی‌‌های بالینی [1] و مطالعات مشاهده‌ای اپیدمیو...

Minimal reporting standard for reporting hearing outcomes.